package maxCount;

public class Solution {
    public int maxCount(int m, int n, int[][] ops) {
         // 找到列和行的最小值
        int minC = m;
        int minR = n;
        for (int i = 0; i < ops.length; i++) {
            minC = Math.min(minC,ops[i][0]);
            minR = Math.min(minR,ops[i][1]);
        }
        return (minR+1)*(minC+1);
    }
}
